Maximum likelihood based estimation of frequency and phase offset in DCT OFDM systems under non-circular transmissions: algorithms, analysis and comparisons

Recently, the advantages of the discrete cosine transform (DCT) based orthogonal frequency-division multiplexing (OFDM) have come to the light. We thus consider DCT- OFDM with non-circular transmission (our results cover circular transmission as well) and present two blind joint maximum- likelihood frequency offset and phase offset estimators. Both our theoretical analysis and numerical comparisons reveal new advantages of DCT-OFDM over the traditional discrete Fourier transform (DFT) based OFDM. These advantages, as well as those already uncovered in the early works on DCT-OFDM, support the belief that DCT-OFDM is a promising multi-carrier modulation scheme

Deep Reinforcement Learning for Real-Time Optimization in NB-IoT Networks

NarrowBand-Internet of Things (NB-IoT) is an emerging cellular-based technology that offers a range of flexible configurations for massive IoT radio access from groups of devices with heterogeneous requirements. A configuration specifies the amount of radio resource allocated to each group of devices for random access and for data transmission. Assuming no knowledge of the traffic statistics, there exists an important challenge in "how to determine the configuration that maximizes the long-term average number of served IoT devices at each Transmission Time Interval (TTI) in an online fashion". Given the complexity of searching for optimal configuration, we first develop real-time configuration selection based on the tabular Q-learning (tabular-Q), the Linear Approximation based Q-learning (LA-Q), and the Deep Neural Network based Q-learning (DQN) in the single-parameter single-group scenario. Our results show that the proposed reinforcement learning based approaches considerably outperform the conventional heuristic approaches based on load estimation (LE-URC) in terms of the number of served IoT devices. This result also indicates that LA-Q and DQN can be good alternatives for tabular-Q to achieve almost the same performance with much less training time. We further advance LA-Q and DQN via Actions Aggregation (AA-LA-Q and AA-DQN) and via Cooperative Multi-Agent learning (CMA-DQN) for the multi-parameter multi-group scenario, thereby solve the problem that Q-learning agents do not converge in high-dimensional configurations. In this scenario, the superiority of the proposed Q-learning approaches over the conventional LE-URC approach significantly improves with the increase of configuration dimensions, and the CMA-DQN approach outperforms the other approaches in both throughput and training efficiency

Cooperative spectrum sensing with secondary user selection for cognitive radio networks over Nakagami-m fading channels

This paper investigates cooperative spectrum sensing (CSS) in cognitive wireless radio networks (CWRNs). A practical system is considered where all channels experience Nakagami-$m$ fading and suffer from background noise. The realisation of the CSS can follow two approaches where the final spectrum decision is based on either only the global decision at fusion centre (FC) or both decisions from the FC and secondary user (SU). By deriving closed-form expressions and bounds of missed detection probability (MDP) and false alarm probability (FAP), we are able to not only demonstrate the impacts of the $m$-parameter on the sensing performance but also evaluate and compare the effectiveness of the two CSS schemes with respect to various fading parameters and the number of SUs. It is interestingly noticed that a smaller number of SUs could be selected to achieve the lower bound of the MDP rather using all the available SUs while still maintaining a low FAP. As a second contribution, we propose a secondary user selection algorithm for the CSS to find the optimised number of SUs for lower complexity and reduced power consumption. Finally, numerical results are provided to demonstrate the findings

Enhancing physical layer security of cognitive radio transceiver via chaotic OFDM

Due to the enormous potential of improving the spectral utilization by using Cognitive Radio (CR), designing adaptive access system and addressing its physical layer security are the most important and challenging issues in CR networks. Since CR transceivers need to transmit over multiple non-contiguous frequency holes, multi-carrier based system is one of the best candidates for CR's physical layer design. In this paper, we propose a combined chaotic scrambling (CS) and chaotic shift keying (CSK) scheme in Orthogonal Frequency Division Multiplexing (OFDM) based CR to enhance its physical layer security. By employing chaos based third order Chebyshev map which allows optimum bit error rate (BER) performance of CSK modulation, the proposed combined scheme outperforms the traditional OFDM system in overlay scenario with Rayleigh fading channel. Importantly, with two layers of encryption based on chaotic scrambling and CSK modulation, large key size can be generated to resist any brute-force attack, leading to a significantly improved level of security

A family of spread-sequences for CDMA system in a multipath fading channel

A new class of orthogonal code-division multiple access (CDMA) system is developed. The key characteristic of the system is that the data symbols are spreaded by a spread-sequence that is longer than the period of the symbol and hence overlapped with the neighboring symbols. Using this approach, temporal diversity is incorporated with other diversities. Due to the temporal diversity, the proposed CDMA system performs well in a fading environment. In this paper, a method for designing such a spread-sequence using filter bank theory is presented. The length of the spread-sequence could be varied according to the requirement. Simulation results show that the proposed spread-sequence based system yields lower BER than the conventional Gold codes based DS/CDMA system.published_or_final_versio

Performance of Generalized Lapped Transform (GLT) Based CDMA System in a Multi-Path Fading Channel

We investigate the performance of a new class of spreading codes in a direct sequence spread spectrum (DSSS/CDMA) system. The spreading and despreading codes are generated from a biorthogonal filter bank whose outputs are of continuous values. The performance of the proposed codes is compared with the Gold codes in a Rayleigh fading multipath channel. Simulation results show that the proposed codes yield lower BER performance than the Gold codes when the number of users is reasonably large.published_or_final_versio

Generalized lapped transform (GLT) based high-speed for transmissionfor wireless mobile communications

In this paper, we describe a generalized lapped transform (GLT) based high-speed transmission technique for wireless mobile communications over Rayleigh fading channels. In this technique, the high-rate data bits are serial-to-parallel converted into low-rate data streams which are then modulated by the GLT based signature sequences. Numerical results show that the GLT based system gives better results than the Walsh code, PN concatenated sequence based system (Letaief et al., 1995)published_or_final_versio

Enhancing secrecy rate in cognitive radio networks via stackelberg game

In this paper, a game theory based cooperation scheme is investigated to enhance the physical layer security in both primary and secondary transmissions of a cognitive radio network (CRN). In CRNs, the primary network may decide to lease its own spectrum for a fraction of time to the secondary nodes in exchange of appropriate remuneration. We consider the secondary transmitter node as a trusted relay for primary transmission to forward primary messages in a decode-and-forward (DF) fashion and, at the same time, allows part of its available power to be used to transmit artificial noise (i.e., jamming signal) to enhance primary and secondary secrecy rates. In order to allocate power between message and jamming signals, we formulate and solve the optimization problem for maximizing the secrecy rates under malicious attempts from EDs. We then analyse the cooperation between the primary and secondary nodes from a game-theoretic perspective where we model their interaction as a Stackelberg game with a theoretically proved and computed Stackelberg equilibrium. We show that the spectrum leasing based on trading secondary access for cooperation by means of relay and jammer is a promising framework for enhancing security in CRNs

Modeling and Analysis of D2D Millimeter-Wave Networks With Poisson Cluster Processes

This paper investigates the performance of millimeter wave (mmWave) communications in clustered device-to-device (D2D) networks. The locations of D2D transceivers are modeled as a Poisson Cluster Process (PCP). In each cluster, devices are equipped with multiple antennas, and the active D2D transmitter (D2D-Tx) utilizes mmWave to serve one of the proximate D2D receivers (D2D-Rxs). Specifically, we introduce three user association strategies: 1) Uniformly distributed D2D-Tx model; 2) Nearest D2D-Tx model; 3) Closest line-of-site (LOS) D2D-Tx model. To characterize the performance of the considered scenarios, we derive new analytical expressions for the coverage probability and area spectral efficiency (ASE). Additionally, in order to efficiently illustrating the general trends of our system, a closed-form lower bound for the special case interfered by intra-cluster LOS links is derived. We provide Monte Carlo simulations to corroborate the theoretical results and show that: 1) The coverage probability is mainly affected by the intra-cluster interference with LOS links; 2) There exists an optimum number of simultaneously active D2D-Txs in each cluster for maximizing ASE; and 3) Closest LOS model outperforms the other two scenarios but at the cost of extra system overhead.Comment: This paper has been published in IEEE Transactions on Communications. Please cite the formal version of this pape